Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time
نویسندگان
چکیده
We investigate the problem of detecting rigid components (maximal Laman subgraphs) in a pseudotriangulation mechanism and in arbitrary pointed planar frameworks. For general Laman graphs with some missing edges, it is known that rigid components can be computed in O(n) time. Here we make substantial use of the special geometry of pointed pseudo-triangulation mechanisms to achieve linear time. The main application is a more robust implementation and a substantial reduction in numerical computations for the solution to the Carpenter’s Rule problem given by the second author.
منابع مشابه
Resolving Loads with Positive Interior Stresses ( Extended
If the load F produces a linear or angular momentum it cannot be resolved by any framework. Therefore we restrict ourselves to loads with ∑ pi fi = 0 and ∑ pi 〈pi , fi〉 = 0. (The vector pi denotes pi rotated by 90 degrees.) If a framework can resolve any load it is called statically rigid. Static rigidity is an equivalent condition for infinitesimal rigidity (see [3]). In general a statically r...
متن کاملM ar 2 00 5 COMBINATORIAL PSEUDO - TRIANGULATIONS
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...
متن کامل. C O ] 2 9 Ju l 2 00 3 COMBINATORIAL PSEUDO - TRIANGULATIONS
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...
متن کاملCombinatorial pseudo-triangulations
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...
متن کاملMinimum Weight Pseudo-Triangulations
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i.e., there exists a point set S for which every pseudotriangulation has weight Ω(log n · wt(M(S))), where wt(M(S)) i...
متن کامل